Asymptotic Joint Normality of Counts of Uncorrelated Motifs in Recursive Trees
نویسندگان
چکیده
منابع مشابه
Asymptotic joint normality of counts of uncorrelated motifs in recursive trees
We study the fringe of random recursive trees, by analyzing the joint distribution of the counts of uncorrelated motifs. Our approach allows for finite and countably infinite collections. To be able to deal with the collection when it is infinitely countable, we use measure-theoretic themes. Each member of a collection of motifs occurs a certain number of times on the fringe. We show that these...
متن کاملAsymptotic joint normality of the granulometric moments
If a random set (binary image) is composed of randomly sized, disjoint translates arising as homothetics of a ®nite number of compact primitives and a granulometry is generated by a convex, compact set, then the granulometric moments of the random set can be expressed in terms of model parameters. This paper shows that, under mild conditions , any ®nite vector of granulometric moments possesses...
متن کاملOn the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive Trees
ISSN: 1058-6458 (Print) 1944-950X (Online) Journal homepage: http://www.tandfonline.com/loi/uexm20 On the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive Trees Mohan Gopaladesikan, Stephan Wagner & Mark Daniel Ward To cite this article: Mohan Gopaladesikan, Stephan Wagner & Mark Daniel Ward (2016) On the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive...
متن کاملAsymptotic normality of recursive algorithms via martingale difference arrays
are such that if input data of size N produce random costs LN , then LN D = Ln + L̄N−n + RN for N ≥ n0 ≥ 2, where n follows a certain distribution PN on the integers {0, . . . ,N} and Lk D = L̄k for k ≥ 0. Ln, LN−n and RN are independent, conditional on n, and RN are random variables, which may also depend on n, corresponding to the cost of splitting the input data of size N (into subsets of size...
متن کاملAsymptotic degree distribution in random recursive trees
The distributions of vertex degrees in random recursive trees and random plane recursive trees are shown to be asymptotically normal. Formulas are given for the asymptotic variances and covariances of the number of vertices with given outdegrees. We also give functional limit theorems for the evolution as vertices are added. The proofs use some old and new results about generalized Pólya urn mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Methodology and Computing in Applied Probability
سال: 2013
ISSN: 1387-5841,1573-7713
DOI: 10.1007/s11009-013-9333-z